On an Operator Preserving Inequalities between Polynomials

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Operator Product Inequalities for Polynomials

Let P (z) be a polynomial of degree n ≥ 1. In this paper we define an operator B, as following, B[P (z)] := λ 0 P (z) + λ 1 (nz 2) P ′ (z) 1! + λ 2 (nz 2) 2 P ′′ (z) 2! , where λ 0 , λ 1 and λ 2 are such that all the zeros of u(z) = λ 0 + c(n, 1)λ 1 z + c(n, 2)λ 2 z 2 lie in half plane |z| ≤ |z − n 2 | and obtain a new generalization of some well-known results.

متن کامل

Inequalities between Gamma-Polynomials of Graph-Associahedra

We prove a conjecture of Postnikov, Reiner and Williams by defining a partial order on the set of tree graphs with n vertices that induces inequalities between the γ-polynomials of their associated graph-associahedra. The partial order is given by relating trees that can be obtained from one another by operations called tree shifts. We also show that tree shifts lower the γ-polynomials of graph...

متن کامل

A note on inequalities for Tsallis relative operator entropy

‎In this short note‎, ‎we present some inequalities for relative operator entropy which are generalizations of some results obtained by Zou [Operator inequalities associated with Tsallis relative operator entropy‎, ‎{em Math‎. ‎Inequal‎. ‎Appl.}‎ ‎{18} (2015)‎, ‎no‎. ‎2‎, ‎401--406]‎. ‎Meanwhile‎, ‎we also show some new lower and upper bounds for relative operator entropy and Tsallis relative o...

متن کامل

Further inequalities for operator space numerical radius on 2*2 operator ‎matrices

‎We present some inequalities for operator space numerical radius of $2times 2$ block matrices on the matrix space $mathcal{M}_n(X)$‎, ‎when $X$ is a numerical radius operator space‎. ‎These inequalities contain some upper and lower bounds for operator space numerical radius.

متن کامل

Some Inequalities on Chromatic Polynomials

For a given graph G, let P (G,λ) be the chromatic polynomial of G, where λ is considered to be a real number. In this paper, we study the bounds for P (G,λ)/P (G,λ − 1) and P (G,λ)/P (G − x, λ), where x is a vertex in G, λ ≥ n and n is the number of vertices of G.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics

سال: 2012

ISSN: 2152-7385,2152-7393

DOI: 10.4236/am.2012.36085